Shortest path problem - PDFSEARCH.IO - Document Search Engine

Shortest path problem
Results: 829

#	Item
321	Flows Advanced Algorithms – COMS31900 G = (V, E) is a directed graph with two special vertices s and t, where s is the source and t is the target. We write u → v to denote the directed edge from u to v . Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Combinatorial optimization Maximum flow problem Flow network Ford–Fulkerson algorithm Max-flow min-cut theorem Cut Minimum cut Shortest path problem Network flow Graph theory Mathematics
322	PARSING AND HYPERGRAPHS Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2001-10-09 21:41:35 Compiler construction Search algorithms Chart parser Parsing Bottom-up parsing Top-down parsing Tree traversal Hypergraph Shortest path problem Mathematics Graph theory Theoretical computer science
323	FloeBier2011_MH_report.dvi Add to Reading List Source URL: www.mech.kuleuven.be Language: English - Date: 2011-06-11 12:04:31 Shortest path problem Applied mathematics Geometric group theory Deduction Orbifold Mathematics Theoretical computer science Network theory
324	iRoad: A Framework For Scalable Predictive Query Processing On Road Networks ∗ Abdeltawab M. Hendawi Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2015-04-07 01:41:51 Network theory Graph connectivity Reachability R-tree Routing Shortest path problem Pruning Distributed data storage Bx-tree Graph theory Mathematics Theoretical computer science
325	24 IP1 ”If You Can Specify It, You Can Analyze It” —The Lasting Legacy of Philippe Flajolet The ”Flajolet School” of the analysis of algorithms and Add to Reading List Source URL: www.siam.org Language: English - Date: 2012-12-18 10:42:32 Algorithm Mathematical logic Shortest path problem Matching Tree decomposition Matroid Combinatorics Randomized algorithm Mathematics Theoretical computer science Graph theory
326	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
327	Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-23 08:47:12 Route inspection problem Multigraph Graph Line graph Degree Directed graph Clique Shortest path problem BEST theorem Graph theory NP-complete problems Eulerian path
328	Maximizing visibility in collaborative trajectory planning Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we address the issue of coordinating the trajectories of two collaborating robots in environments w Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2014-04-09 00:40:59 Theoretical computer science Motion planning Robot Shortest path problem Dynamic programming Optimal control Mobile robot Mathematical optimization Mathematics Applied mathematics
329	On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2013-05-18 17:31:04 Search algorithms Pursuit-evasion game theory Shortest path problem NP-complete Planar graph Breadth-first search Binary tree Depth-first search Graph theory Theoretical computer science Mathematics
330	Longest Paths in Planar DAGs in Unambiguous Log-Space Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:29:35 Directed acyclic graph Shortest path problem Graph coloring Planarity testing Tree Matroid theory Path decomposition Chromatic polynomial Graph theory Planar graphs Network theory

UPDATE